Explanation-Based Generalization for Negation as Failure and Multiple Examples
نویسنده
چکیده
We report on a combined approach to solve two known problems of traditional Explanation-Based Generalization (EBG) concerning utility and expressiveness. (1) Usually, for each training example a new rule is derived and added separately. Therefore, the overall performance of the associated inference system may degrade if the presented instances are numerous and not representative for the class of applications. (2) Traditional EBG cannot be used for normal domain theories in which negations appear in clause bodies. This lack of expressiveness excludes otherwise interesting applications, e.g. in the area of game playing. As a possible solution for the utility problem (1), it has been proposed earlier [?, ?, ?, ?, ?] to consider multiple examples at the same time and to find a common generalization, thereby compensating for the influence of misleading ones. (2) An extension of EBG for Negation as Failure was described in [?]. However, it is based on Explanation-Based Generalization of Failure (EBGF) [?] which can suffer from an inefficient, redundant representation of rules. This weakness is closely related to a similar one in EBG (1) which is caused by considering training examples independently of each other. The new approach presented here overcomes this drawback by using more than one example also for EBGF. Moreover, we propose a unifying framework for EBG which is able to deal as well with multiple training instances simultaneously as with negation in domain theories.
منابع مشابه
An Extension of Explanation-Based Generalization to Negation as Failure
Implementations of Explanation-Based Generalization (EBG) within a logic-programming environment, as e.g. the well-known PROLOG-EBG algorithm KCMcC87], are able to generalize the proof of a goal from a deenite (i.e. Horn clause) domain theory. However, it is a fact that practical applications frequently require the enhanced ex-pressiveness of negations in rule bodies. Speciically, this is the c...
متن کاملGeneralized Birnbaum-Saunders Distribution
The two-parameter Birnbaum–Saunders (BS) distribution was originally proposed as a failure time distribution for fatigue failure caused under cyclic loading. BS model is a positively skewed statistical distribution which has received great attention in recent decades. Several extensions of this distribution with various degrees of skewness, kurtosis and modality are considered. In particular, a...
متن کاملProduction Systems Need Negation as Failure
We study action rule based systems with two forms of negation, namely classical negation and \negation as failure to nd a course of actions". We show by several examples that adding negation as failure to such systems increase their expressiveness, in the sense that real life problems can be represented in a natural and simple way. Then, we address the problem of providing a formal declarative ...
متن کاملOrder and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logic programming with ordered disjunction. The simulation also supports a broader application of “ordered disjunction”...
متن کاملEmbedded Implications as a Generalization of Negation as Failure
We introduce the new class of logic programs with a non-monotonic operator, namely, the programs with universally quantiied embedded implications. The main reason for this is expressiveness of programs. The main subject of the paper is generalization of notions and theorems , related to the declarative and procedural semantics for normal logic programs, to the class of programs with implication...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996